Towards an Efficient Structural Analysis of Colored Petri Nets
نویسندگان
چکیده
This paper presents the Backward reachability which is a structural analysis method applicable to Colored Petri Nets (CPN). This method avoids the fastidious computation of simulation and the combinatorial explosion of reachable state space. The backward reachability provides the information about different ways of reaching a particular CPN marking. This evaluation considers the evolution of markings participating in each sequence leading to the desired state. The analysis is performed on an inverse CPN which is obtained by transforming original CPN according to given inversion rules. The work develops the rules allowing the definition of inverse CPN and presents some transformations that contribute to the analysis speed up. The main advantage of this method is that it allows to determine the sequence leading from any initial state to a given final marking without investigating all possible sequences.
منابع مشابه
Accessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملFull structural model refinement as type refinement of colored Petri nets
In this paper we propose a method for implementing a full structural model refinement of a (biological) model represented as a (colored) Petri net. We build on the full structural data refinement definition of C. Gratie and Petre, and the type refinement of colored Petri nets introduced by Charles Lakos. Given a (biological) reaction-based model and a desired full structural refinement of it, w...
متن کاملTowards Modeling and Simulating a Multi-party Negotiation Protocol with Colored Petri Nets
E-contracting, i.e., establishing and enacting electronic contracts, has become important because of technological advances (e.g., the availability of web services) and more open markets. However, the establishment of an e-contract is complicated and error prone. There are multiple negotiation styles ranging from auctions to bilateral bargaining. This paper provides an approach for modeling mul...
متن کاملAvailability evaluation of Software architecture of object oriented Style using coloured Petri nets
Software architecture is one of the most fundamental products in the process of software development in the areas of behavioral or non- behavioral features like availability or transformability change. There are different ways to evaluate software architecture one of which is the creation of application model. An executable model of software architecture is an official description of architectu...
متن کامل